On an Interval Computational Method for Finding
ثبت نشده
چکیده
with fixed initial data x(t = x where x is the n-dimensional o) o' state vector, u is the r-dimensional vector control function, A(t) , B(t) are the nxn, nxr matrix functions, respectively. A(t), B(t), are assumed to be piecewise continuous for t ~ to on any finite in terval. A control function u(t) is said to be admissible if it is measur able over any finite interval and takes its values from a given compact Er. set U of Let U denote the set of all admissible control functions. Given an initial state
منابع مشابه
Application of Collocation Method in Finding Roots
In this paper we present a new method to find simple or multiple roots of functions in a finite interval. In this method using bisection method we can find an interval such that this function is one to one on it, thus we can transform problem of finding roots in this interval into an ordinary differential equation with boundary conditions. By solving this equation using collocation method we ca...
متن کاملAn Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
متن کاملA numerical technique for solving a class of 2D variational problems using Legendre spectral method
An effective numerical method based on Legendre polynomials is proposed for the solution of a class of variational problems with suitable boundary conditions. The Ritz spectral method is used for finding the approximate solution of the problem. By utilizing the Ritz method, the given nonlinear variational problem reduces to the problem of solving a system of algebraic equations. The advantage o...
متن کاملAnalytical and Verified Numerical Results Concerning Interval Continuous-time Algebraic Riccati Equations
This paper focuses on studying the interval continuous-time algebraic Riccati equation A∗X + XA + Q − XGX = 0, both from the theoretical aspects and the computational ones. In theoretical parts, we show that Shary’s results for interval linear systems can only be partially generalized to this interval Riccati matrix equation. We then derive an efficient technique for enclosing the united stable...
متن کاملInterval fractional integrodifferential equations without singular kernel by fixed point in partially ordered sets
This work is devoted to the study of global solution for initial value problem of interval fractional integrodifferential equations involving Caputo-Fabrizio fractional derivative without singular kernel admitting only the existence of a lower solution or an upper solution. Our method is based on fixed point in partially ordered sets. In this study, we guaranty the existence of special kind of ...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011